Lecture 17 : Maximum Flow and Minimum Cut
نویسنده
چکیده
Last lecture we studied duality of linear programs (LP), specifically how to construct the dual, the relation between the optimum of an LP and its dual, and some duality applications. In this lecture, we will talk about another application of duality to prove one of the theorems in combinatorics so called Maximum Flow-Minimum Cut Problem. The theorem roughly says that in any graph, the value of maximum flow is equal to capacity of minimum cut.
منابع مشابه
Recovery in Perturbation - Stable Maximum Cut Instances ∗
Today we continue our discussion of exact recovery under perturbation-stability assumptions. We’ll look at a different cut problem than last lecture, and this will also give us an excuse to touch on two cool and fundamental topics, metric embeddings and semidefinite programming. The Maximum Cut problem is a famous NP -hard problem. The input is an undirected graph G = (V,E), where each edge e ∈...
متن کاملar X iv : c on d - m at / 9 70 50 10 1 M ay 1 99 7 Frustrated Systems : Ground State Properties via Combinatorial Optimization ?
An introduction to the application of combinatorial optimization methods to ground state calculations of frustrated, disordered systems is given. We discuss the interface problem in the random bond Ising ferromagnet, the random field Ising model, the diluted antiferromagnet in an external field, the spin glass problem, the solid-on-solid model with a disordered substrate and other convex cost f...
متن کاملCS261: A Second Course in Algorithms Lecture #20: The Maximum Cut Problem and Semidefinite Programming∗
Now that you’re finishing CS261, you’re well equipped to comprehend a lot of advanced material on algorithms. This lecture illustrates this point by teaching you about a cool and famous approximation algorithm. In the maximum cut problem, the input is an undirected graph G = (V,E) with a nonnegative weight we ≥ 0 for each edge e ∈ E. The goal is to compute a cut — a partition of the vertex set ...
متن کاملLecture 04 / 13 : Graph Sampling and Sparsification
In previous lectures, we discussed various topics on graph: sparsest cut, clustering which finds small k-cuts, max flow, multicommodity flow, etc. For very large graphs, we’d like to ask “instead of regular approximation algorithms which run in polynomial time, can we find any near-linear time algorithm for minimum cut or maximum flow problems?”. A simple idea is for a given graph G, to solve t...
متن کاملLecture 2 : Karger ’ s Min Cut Algorithm
(These notes are a slightly modified version of notes from previous offerings of the class scribed by Sanjeev.) Today’s topic is simple but gorgeous: Karger’s min cut algorithm and its extension. It is a simple randomized algorithm for finding the minimum cut in a graph: a subset of vertices S in which the set of edges leaving S, denoted E(S, S) has minimum size among all subsets. You may have ...
متن کامل